Operations on distribution functions not derivable from operations on random variables
نویسندگان
چکیده
منابع مشابه
Arithmetic Operations on Independent Random Variables: A Numerical Approach
Dealing with imprecise quantities is an important problem in scientific computation. Model parameters are known only approximately, typically in the form of probability density functions. Unfortunately there are currently no methods of taking uncertain parameters into account which would at the same time be easy to apply and highly accurate. An important special case is operations on independen...
متن کاملOperations on logic functions and variables through sign Haar spectra
A non-linear transform, called ‘‘sign Haar transform’’ has recently been introduced. The transform is unique and converts binary/ternary vectors into ternary spectral domain. Recursive definitions for the calculation of sign Haar transform are developed. Essential properties of logic functions and variables in the spectral domain of a quantized transform based on Haar functions are presented. S...
متن کاملEffective operations on partial functions
Once we have studied effectively computable operations on numbers it is natural to ask whether there is a comparable notion for operations on functions. The essential difference between functions and numbers as basic objects is that functions are usually infinite rather than finite. With this in mind, in §1 of this chapter we discuss the features we might reasonably expect of an effective opera...
متن کاملBasic Functions and Operations on Functions
We define the following mappings: the characteristic function of a subset of a set, the inclusion function (injection or embedding), the projections from a Cartesian product onto its arguments and diagonal function (inclusion of a set into its Cartesian square). Some operations on functions are also defined: the products of two functions (the complex function and the more general product-functi...
متن کاملOn exponential domination and graph operations
An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 1974
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm-52-1-43-52